Schema induction for logic program synthesis

A Logic Program Schema and Its Applications

In t h i s paper we cons ide r a . spec i f i c type of l o g i c programs ca l led recursive-schema programs and show t h a t the c l ass of r ecu rs i ve -schema programs has s u f f i c i e n t e x p r e s s i v e c a p a b i l i t y , which provides an a l t e r n a t i v e simple proof fo r the resultby Tarnlund concerning the computat ional power of Horn c lause programs. F u r t h e r , ...

Schema-Guided Synthesis of Constraint Logic Programs

By focusing on the families of assignment and permutation problems (such as graph colouring andn-Queens), we show how to adapt D.R. Smith’s KIDS approach for the synthesis of constraint programs (with implicit constraint satisfaction code thus), rather than applicative Refine programs with explicit constraint propagation and pruning code. Synthesis is guided by a global search schema and can be...

Logic Program Synthesis

> This paper presents an overview and a survey of logic program synthesis. Logic program synthesis is interpreted here in a broad way; it is concerned with the following question: given a speciication, how do we get a logic program satisfying the speciication? Logic programming provides a uniquely nice and uniform framework for program synthesis since the speciication, the synthesis process and...

Iterative Induction of Logic Programs, An approach to logic program synthesis from incomplete specifications

ALPS: A Logic for Program Synthesis

Let us briefly describe a pedagogical example from [15] and a real-life example. Our pedagogical example is a triangle. A triangle is described by its angles A,B, C and side lengths a, b, c, and we know the following relations between them: A+ B+C = π (the sum of the angles is 180, or π radians), a2+b2−2ab cosC = c and similar expressions for a and b (cosine theorem), and a/ sin A = b/ sin B = ...